A lattice point problem on the regular tree

Huber (1956) [8] considered the following problem on the hyperbolic plane H. Consider a strictly hyperbolic subgroup of automorphisms on H with compact quotient, and choose a conjugacy class in this group. Count the number of vertices inside an increasing ball, which are images of a fixed point x∈H under automorphisms in the chosen conjugacy class, and describe the asymptotic behaviour of this number as the size of the ball goes to infinity. We use a well-known analogy between the hyperbolic plane and the regular tree to solve this problem on the regular tree.     

Thompson＇s Group F and the Linear Group GL∞（Z）

The authors study the finite decomposition complexity of metric spaces of H, equipped with different metrics, where H is a subgroup of the linear group GL_∞(ℤ). It is proved that there is an injective Lipschitz map φ: (F, d _S ) → (H, d), where F is the Thompson’s group, dS the word-metric of F with respect to the finite generating set S and d a metric of H. But it is not a proper map. Meanwhile, it is proved that φ: (F, d _S ) → (H, d ₁) is not a Lipschitz map, where d ₁ is another metric of H.     

The critical group of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">m</Emphasis></Subscript> × <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

In this paper, the structure of the critical group of the graph K _m × C _n is determined, where m, n ≥ 3.     

Non-separating trees in connected graphs

Let T be any tree of order d≥1. We prove that every connected graph G with minimum degree d contains a subtree T^′ isomorphic to T such that G−V(T^′) is connected.     

The rotor-router model on regular trees

The rotor-router model is a deterministic analogue of random walk. It can be used to define a deterministic growth model analogous to internal DLA. We show that the set of occupied sites for this model on an infinite regular tree is a perfect ball whenever it can be, provided the initial rotor configuration is acyclic (that is, no two neighboring vertices have rotors pointing to one another). This is proved by defining the rotor-router group of a graph, which we show is isomorphic to the sandpile group. We also address the question of recurrence and transience: We give two rotor configurations on the infinite ternary tree, one for which chips exactly alternate escaping to infinity with returning to the origin, and one for which every chip returns to the origin. Further, we characterize the possible “escape sequences” for the ternary tree, that is, binary words a₁…an for which there exists a rotor configuration so that the kth chip escapes to infinity if and only if ak=1.     

Quasi-median hulls in Hamming space are Steiner hulls

A Hamming space Λⁿ consists of all sequences of length n over an alphabet Λ and is endowed with the Hamming distance. In particular, any set of aligned DNA sequences of fixed length constitutes a subspace of a Hamming space with respect to mismatch distance. The quasi-median operation returns for any three sequences u,v,w the sequence which in each coordinate attains either the majority coordinate from u,v,w or else (in the case of a tie) the coordinate of the first entry, u; for a subset of Λⁿ the iterative application of this operation stabilizes in its quasi-median hull. We show that for every finite tree interconnecting a given subset X of Λⁿ there exists a shortest realization within Λⁿ for which all interior nodes belong to the quasi-median hull of X. Hence the quasi-median hull serves as a Steiner hull for the Steiner problem in Hamming space.     

The clique-separator graph for chordal graphs

We present a new representation of a chordal graph called the clique-separator graph, whose nodes are the maximal cliques and minimal vertex separators of the graph. We present structural properties of the clique-separator graph and additional properties when the chordal graph is an interval graph, proper interval graph, or split graph. We also characterize proper interval graphs and split graphs in terms of the clique-separator graph. We present an algorithm that constructs the clique-separator graph of a chordal graph in O(n³) time and of an interval graph in O(n²) time, where n is the number of vertices in the graph.     

A Note on Some Sub-Equation Methods and New Types of Exact Travelling Wave Solutions for Two Nonlinear Partial Differential Equations

Sub-equation methods are used for constructing exact travelling wave solutions of nonlinear partial differential equations. The key idea of these methods is to take full advantage of all kinds of special solutions of sub-equation, which is usually a nonlinear ordinary differential equation. We present a function transformation which not only gives us a clear relation among these sub-equation methods, but also can be used to obtain the general solutions of these sub-equations. And then new exact travelling wave solutions of the CKdV-MKdV equation and the CKdV equations as applications of this transformation are obtained, and the approach presented in this paper can be also applied to other nonlinear partial differential equations.      

On the no-arbitrage condition in option implied trees

The aim of this paper is to discuss the no-arbitrage condition in option implied trees based on forward induction and to propose a no-arbitrage test that rules out the negative probabilities problem and hence enhances the pricing performance. The no-arbitrage condition takes into account two main features: the position of the node in the tree and the relation between the dividend yield and the risk-free rate. The proposed methodology is tested in and out of sample with Italian index options data and findings support a good pricing performance.